SDL Versus C Equivalence Checking

نویسندگان

  • Malek Haroud
  • Armin Biere
چکیده

We present a tool that automatically checks the existence of a bisimulation relation between an SDL specification and the corresponding auto-generated C code. The tool has been used to verify part of the C implementation of a WiFi Medium Access Controller (i.e.; IEEE 802.11) that has been derived from its original SDL specification using the Telelogic CAdvanced Code Generator.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositional M-net Semantics for the Veriication of Sdl-speciications

In this paper a new approach to the veriication of SDL-speciications is presented. The key idea of the method consists in associating a compositional Petri net semantics to SDL-speciications. A temporal logic is deened which allows the formulation of relevant properties of SDL-speciications. The model checking problem for SDL-speciications according to this logic is then reduced to the model ch...

متن کامل

MOBY { More than a Tool for the Veri cation ofSDL -

In this paper a new approach to the veriication of SDL-speciications is presented. The key idea of the method consists of associating a com-positional Petri net semantics to SDL-speciications. A temporal logic is deened which allows the formulation of relevant properties of SDL-speciications. The model checking problem for SDL-speciications according to this logic is then reduced to the model c...

متن کامل

Extending the Translation from SDL to Promela

In this paper, we tackle the problem of model-checking SDL programs that use the save operator. Previous work on model-checking SDL programs with SPIN consists in translating SDL into IF (using sdl2if) and nally IF to Promela (if2pml). Nevertheless the save operator of SDL is not handled by the ( nal) translator if2pml. We propose an extension of the tool if2pml that translates IF programs with...

متن کامل

5 . Model Checking SDL with Spin

We present an attempt to use the model checker Spin as a verification engine for SDL, with special emphasis put on the verification of timing properties of SDL models. We have extended Spin with a front-end that allows to translate SDL to Promela (the input language of Spin), and a back-end that allows to analyse timing properties. Compared with the previous attempts, our approach allows to ver...

متن کامل

Verifying Large SDL-Specifications Using Model Checking

ion: Does system S satisfy property f ? abstract interpretationinterpretation “preservation” f ⇐ f

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005